Efficient Integration of Photovoltaic Solar Generators in Monopolar DC Networks through a Convex Mixed-Integer Optimization Model
نویسندگان
چکیده
The problem regarding the optimal siting and sizing of photovoltaic (PV) generation units in electrical distribution networks with monopolar direct current (DC) operation technology was addressed this research by proposing a two-stage convex optimization (TSCO) approach. In first stage, exact mixed-integer nonlinear programming (MINLP) formulation relaxed via linear programming, defining nodes where PV must be placed. second power flow associated solved approximating component MINLP model into second-order cone equivalent. main contribution is use two approximations to efficiently solve studied problem, taking advantage models. numerical results DC version IEEE 33-bus grid demonstrate effectiveness proposed approach when compared multiple combinatorial methods. Two evaluations were conducted, confirm efficiency model. evaluation considered without limitations all branches, later compare it different metaheuristic approaches (discrete versions Chu Beasley genetic algorithm, vortex search generalized normal optimizer); simulation included thermal limits model’s optimization. showed that maximum point tracking not regarded as decision-making criterion, expected annual investment operating costs exhibited better performances, i.e., additional reductions about USD 100,000 cases scenarios involving tracking.
منابع مشابه
Polyhedral approximation in mixed-integer convex optimization
Generalizing both mixed-integer linear optimization and convex optimization, mixed-integer convex optimization possesses broad modeling power but has seen relatively few advances in general-purpose solvers in recent years. In this paper, we intend to provide a broadly accessible introduction to our recent work in developing algorithms and software for this problem class. Our approach is based o...
متن کاملInteger convex minimization by mixed integer linear optimization
Minimizing a convex function over the integral points of a bounded convex set is polynomial in fixed dimension [6]. We provide an alternative, short, and geometrically motivated proof of this result. In particular, we present an oraclepolynomial algorithm based on a mixed integer linear optimization oracle.
متن کاملMirror-Descent Methods in Mixed-Integer Convex Optimization
In this paper, we address the problem of minimizing a convex function f over a convex set, with the extra constraint that some variables must be integer. This problem, even when f is a piecewise linear function, is NP-hard. We study an algorithmic approach to this problem, postponing its hardness to the realization of an oracle. If this oracle can be realized in polynomial time, then the proble...
متن کاملMixed-Integer Convex Representability
We consider the question of which nonconvex sets can be represented exactly as the feasible sets of mixed-integer convex optimization problems. We state the first complete characterization for the case when the number of possible integer assignments is finite. We develop a characterization for the more general case of unbounded integer variables together with a simple necessary condition for re...
متن کاملGlobal Inverse Kinematics via Mixed-Integer Convex Optimization
In this paper we present a novel formulation of the inverse kinematics (IK) problem with generic constraints as a mixed-integer convex optimization program. The proposed approach can solve the IK problem globally with generic task space constraints, a major improvement over existing approaches, which either solve the problem in only a local neighborhood of the user initial guess through nonline...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sustainability
سال: 2023
ISSN: ['2071-1050']
DOI: https://doi.org/10.3390/su15108093